Set containment inference and syllogisms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set Containment Characterization

Characterization of the containment of a polyhedral set in a closed halfspace, a key factor in generating knowledge-based support vector machine classifiers [7], is extended to the following: (i) Containment of one polyhedral set in another. (ii) Containment of a polyhedral set in a reverse-convex set defined by convex quadratic constraints. (iii) Containment of a general closed convex set, def...

متن کامل

Compiling Away Set Containment and Intersection Joins

We investigate the effect of query rewriting on joins involving set-valued attributes in object-relational database management systems. We show that by unnesting set-valued attributes (that are stored in an internal nested representation) prior to the actual set containment or intersection join we can improve the performance of query evaluation by an order of magnitude. By giving example query ...

متن کامل

Comparative and quantitative syllogisms

Traditionally, syllogisms are arguments with two premises and one conclusion which are constructed by propositions of the form “All... are...” and “At least one... is...” and their respective negated versions. Unfortunately, the practical use of traditional syllogisms is quite restricted. On the one hand, the “All...” propositions are too strict, since a single counterexample suffices for falsi...

متن کامل

PIEJoin: Towards Parallel Set Containment Joins

The efficient computation of set containment joins (SCJ) over set-valued attributes is a well-studied problem with many applications in commercial and scientific fields. Nevertheless, there still exists a number of open questions: An extensive comparative evaluation is still missing, the two most recent algorithms have not yet been compared to each other, and the exact impact of item sort order...

متن کامل

Parry Syllogisms

Parry discusses an extension of Aristotle’s syllogistic that uses four nontraditional quantifiers. We show that his conjectured decision procedure for validity for the extended syllogistic is correct even if syllogisms have more than two premises. And we axiomatize this extension of the syllogistic. 1 Background and motivation Parry [2] discusses an extension of the syllogistic in which sentenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1986

ISSN: 0304-3975

DOI: 10.1016/0304-3975(86)90011-3